Spanning Tree Game as Prim Would Have Played
نویسندگان
چکیده
منابع مشابه
Would Aristotle have played Russian Roulette ?
This paper continues the debate between myselfand Peter Singer et al started in the Journal of Medical Ethics volume 21, no 3 about the ethical respectability of the use of QALYs in health care allocation. It discusses the question of what, in the way of health care provision, would be chosen by rational egoists behind a Rawlsian "veil of ignorance", and takes forward the vexed question of what...
متن کاملWould Aristotle have played Russian roulette?
This paper continues the debate between myself and Peter Singer et al started in the Journal of Medical Ethics volume 21, no 3 about the ethical respectability of the use of QALYs in health care allocation. It discusses the question of what, in the way of health care provision, would be chosen by rational egoists behind a Rawlsian "veil of ignorance", and takes forward the vexed question of wha...
متن کاملDebate Would Aristotle have played Russian Roulette ?
This paper continues the debate between myselfand Peter Singer et al started in the Journal of Medical Ethics volume 21, no 3 about the ethical respectability of the use of QALYs in health care allocation. It discusses the question of what, in the way of health care provision, would be chosen by rational egoists behind a Rawlsian "veil of ignorance", and takes forward the vexed question of what...
متن کاملDomination game played on trees and spanning subgraphs
The domination game, played on a graph G, was introduced in [3]. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G dominated to that point in the game. Both players use an optimal strategy–Dominator plays so as to end the game as quickly as possible, Staller plays in such a way that the game lasts as many steps as ...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2018
ISSN: 0324-721X
DOI: 10.14232/actacyb.23.3.2018.12